Reformulation of Design Optimization Strategies

نویسندگان

  • Thomas Ellman
  • John Keane
  • Takahiro Murata
  • Arunava Banerjee
چکیده

Automatic design optimization is highly sensitive to problem formulation. The choice of objective function, constraints and design parameters can dramatically impact the computational cost of optimization and the quality of the resulting design. The best formulation varies from one application to another. A design engineer will usually not know the best formulation in advance. We have therefore developed a system that supports interactive formulation, testing and reformulation of design optimization strategies. Our system includes an executable, second-order data-ow language for representing optimization strategies. The language allows an engineer to deene multiple stages of optimization, and to specify the design parameters, constraints and objectives to be handled at each stage. We have also developed a set of transformations that reformulate strategies represented in our language. The transformations can approximate objective and constraint functions, deene new constraints, and re-parameterize or change the dimension of the search space, among other things. The system is applicable to design problems in which the artifact is governed by algebraic or ordinary diierential equations. We have tested the system on problems of racing yacht and jet engine nozzle design. We report experimental results demonstrating that our reformulation techniques can signiicantly improve the performance of automatic design optimization.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SOLVING MULTI CONSTRAINTS STRUCTURAL TOPOLOGY OPTIMIZATION PROBLEM WITH REFORMULATION OF LEVEL SET METHOD

Due to the favorable performance of structural topology optimization to create a proper understanding in the early stages of design, this issue is taken into consideration from the standpoint of research or industrial application in recent decades. Over the last three decades, several methods have been proposed for topology optimization. One of the methods that has been effectively used in stru...

متن کامل

A Transformation System for Interactive Reformulation of Design Optimization Strategies

Automatic design optimization is highly sensitive to problem formulation. The choice of objective function, constraints and design parameters can dramatically impact the computational cost of optimization and the quality of the resulting design. The best formulation varies from one application to another. A design engineer will usually not know the best formulation in advance. In order to addre...

متن کامل

Learning When Reformulation is Appropriate for Iterative Design

It is well known that search-space reformulation can improve the speed and reliability of numerical optimization in engineering design. We argue that the best choice of reformulation depends on the design goal, and present a technique for automatically constructing rules that map the design goal into a reformulation chosen from a space of possible reformulations. We tested our technique in the ...

متن کامل

Interval-based global optimization in engineering using model reformulation and constraint propagation

This paper deals with the preliminary design problem when the product is modeled as an analytic model. The analytic models based method aims to use mathematical equations to address both multiphysic and economic characteristics of a product. The proposed approach is to convert the preliminary design problem into a global constrained optimization problem. The objective is to develop powerful opt...

متن کامل

Optimization of RFM's Structure Using a New Reformulation of PSO in Case of Limited GCPs

Metaheuristic algorithms have been widely used in determining the optimum rational polynomial coefficients (RPCs). By eliminating a number of unnecessary RPCs, these algorithms increase the accuracy of geometric correction of high-resolution satellite images. To this end, these algorithms use ordinary least squares and a number of ground control points (GCPs) to determine RPCs' values. Due to t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996